Program using rjMCMC for exploring allopolyploid network priors

نویسنده

  • Graham Jones
چکیده

Suppose there are d diploids and m tetraploids. In the language of [2], there are m models h = 1, h = 2, . . .h = m, where h is the number of hybridizations. Each model has a different number of parameters. The main difficulty with the network prior is that the normalization constants are needed for the different models. Let W be the network topology and node times. The conditional priors π(W |h) must be comparable for different values of h. To do this analytically, it is necessary to integrate out the parameters in W , ie calculate for each h the value of

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian and Monte Carlo change-point detection

The contribution presents to analyses and comparison of the recursive (sliding window) Bayesian autoregressive normalized change-point detector (RBACDN) and the reversible jump Markov chain Monte Carlo method (RJMCMC) when they are used for the localization of signal changes (change-point detection). The choice of priors and parameter setting for the RJMCMC and the RBACDN are discussed. The eva...

متن کامل

Bayesian Input Variable Selection Using Cross-Validation Predictive Densities and Reversible Jump MCMC

We consider the problem of input variable selection of a Bayesian model. With suitable priors it is possible to have a large number of input variables in Bayesian models, as less relevant inputs can have a smaller effect in the model. To make the model more explainable and easier to analyse, or to reduce the cost of making measurements or the cost of computation, it may be useful to select a sm...

متن کامل

Prior, initial state, and MCMC moves for allopolyploid networks

Suppose there are d diploids and m tetraploids. In the language of [2], there are m models h = 1, h = 2, . . . h = m, where h is the number of hybridizations. Each model has a different number of parameters. Let W be the network topology and node times. The conditional priors π(W |h) must be comparable for different values of h in order to calculate the correct acceptance ratios when jumping be...

متن کامل

Extraction de réseaux linéiques à partir d'images satellitaires et aériennes par processus ponctuels marqués. (Line network extraction from satellite and aerial images by marked point processes)

This thesis addresses the problem of the unsupervised extraction of line networks (roads,rivers, etc.) from remotely sensed images. We use object processes, or marked point processes,as prior models. These models benefit from a stochastic framework (robustness w.r.t. noise,algorithms, etc.) while incorporating strong geometric constraints. Optimization is done viasimulated annea...

متن کامل

Random frog: an efficient reversible jump Markov Chain Monte Carlo-like approach for variable selection with applications to gene selection and disease classification.

The identification of disease-relevant genes represents a challenge in microarray-based disease diagnosis where the sample size is often limited. Among established methods, reversible jump Markov Chain Monte Carlo (RJMCMC) methods have proven to be quite promising for variable selection. However, the design and application of an RJMCMC algorithm requires, for example, special criteria for prior...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012